Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Access protocol for terahertz wireless personal area networks based on high efficient handover of piconet coordinator
REN Zhi, TIAN Jieli, YOU Lei, LYU Yuhui
Journal of Computer Applications    2018, 38 (3): 728-733.   DOI: 10.11772/j.issn.1001-9081.2017082062
Abstract465)      PDF (956KB)(401)       Save
To resolve the problems currently existing in access protocol for Terahertz Wireless Personal Area Network (THz-WPAN) for PicoNet Coordinator (PNC) handover process, such as imperfect PNC handover process, redundant information transmission, waste of obvious timeslot resources, an access protocol of piconet coordinator high efficient handover for terahertz wireless personal area networks called PCHEH-AP (Piconet Coordinator High Efficient Handover Access Protocol) was proposed. By using deleting the specified node redundancy information mechanism, confirming first and handover next mechanism, PNC handover adaptive slot allocation mechanism, PCHEH-AP generally regulates the PNC handover process, improves channel utilization, reduces data delay, and makes PNC handover more reasonable and efficient. The simulation results show that compared with the protocol defined by IEEE 802.15.3c and the HTLL-MAC protocol, the data delay of PCHEH-AP is reduced by at least 8.98% and the throughput of MAC layer is also increased by 3.90%.
Reference | Related Articles | Metrics
Routing algorithm based on node similarity in delay/disruption tolerant networks
DAI Chenqu LI Jianbo YOU Lei XU Jixing
Journal of Computer Applications    2014, 34 (9): 2476-2481.   DOI: 10.11772/j.issn.1001-9081.2014.09.2476
Abstract138)      PDF (901KB)(474)       Save

Delay/Disruption Tolerant Network (DTN) has characteristics of long delay, intermittent disruption, and limitation of buffer space and energy. To improve the delivery rate of messages, while reducing network overhead and the average latency, a new Routing Algorithm Based on Node Similarity (RABNS) in DTN was proposed. The algorithm used historical information to predict node encounter probability in future. The nodes which encountered historically were recorded as a collection, then the set intersection operation was applied to evaluate the similarity of a pair of nodes. And the similarity was used to control the number of copies in the network. Simulations were conducted on The ONE platform using RandomWaypoint motion model. In the simulation, RABNS performed better than PROPHET (Probabilistic ROuting Protocol using History of Encounters and Transitivity) in the message delivery rate. And the network overhead of RABNS was about half of PROPHET, which greatly improved the utilization of network resources. The average latency of RABNS was a little higher than Epidemic but lower than PPROPHET, the node cache size did not have a significant impact on average-hops, and its average-hops was about half of PROPHET. The simulation results show that RABNS can effectively limit the message flooding with higher message delivery rate, lower network overhead and average latency, therefore it is suitable for the DTN scenes with limited nodes' storage and also applicable in social DTN with gregarious characteristics.

Reference | Related Articles | Metrics